A strongly complete proof system for propositional dynamic logic
نویسندگان
چکیده
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property j= ' ) ` ') does not hold for the standard nitary axiomatisation. In this paper, we present an in nitary proof system of PDL and prove strong completeness. The result is extended to epistemic logic with common knowledge.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملStrong completeness and limited canonicity for PDL and similar modal logics
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property Γ |= φ ⇒ Γ ` φ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of PDL relative an infinitary proof system containing the rule from [α;βn]φ for all n ∈ N, conclude [α;β∗]φ. The proof uses a universal canonical model, and it is ge...
متن کاملA new proof of completeness for a relative modal logic with composition and intersection
This paper is devoted to the completeness issue of RMLCI | the relative modal logic with composition and intersection | a restriction of the propositional dynamic logic with intersection. The trouble with RMLCI is that the operation of intersection is not modally deenable. Using the notion of mosaics, we give a new proof of a theorem considered in a previous paper \Complete axiomatization of a ...
متن کاملModels for Verifiers
We discuss three classes of models which interpret a natural proof system for Propositional Dynamic Logic. We compare their usefulness as models for verification and show that each of the three classes satisfy the same set of formulae. One of these classes can be used to give a simple proof of completeness of a natural proof system for propositional Dynamic Logic. By the equivalence of their th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003